Simplify: a theorem prover for program checking
نویسندگان
چکیده
منابع مشابه
Program Reenement by Theorem Prover
We describe a prototype tool for developing programs by stepwise reenement in a weakest precondition framework, based on the HOL theorem proving system. Our work is based on a mechanisation of the reenement calculus, which is a theory of correctness preserving program transformations. We also use a tool for window inference that is part of the HOL system. Our tool permits subcomponents of a pro...
متن کاملAutomated Theorem Prover Assisted Program Calculations
Calculational Style of Programming, while very appealing, has several practical difficulties when done manually. Due to the large number of proofs involved, the derivations can be cumbersome and errorprone. To address these issues, we have developed automated theorem provers assisted program and formula transformation rules, which when coupled with the ability to extract context of a subformula...
متن کاملA Theorem Prover for ASTRAL
The ASTRAL real-time formal specification language has been encoded into the PVS theorem prover. A translator has been developed to completely translate any single-level ASTRAL specification into its corresponding PVS encoding. The semantics of the ASTRAL abstract machine have been revised and expanded for use with PVS. This paper describes the encoding and semantics and explains their use alon...
متن کاملThe Theoretical Foundations of LPTP (A Logic Program Theorem Prover)
This article contains the theoretical foundations of LPTP, a logic program theorem prover that has been implemented in Prolog by the author. LPTP is an interactive theorem prover in which one can prove correctness properties of pure Prolog programs that contain negation and built-in predicates like is/2 and call/n + 1. The largest example program that has been verified using LPTP is 635 lines l...
متن کاملUsing the prover ANDP to simplify orthogonality
In the 1920s, Heyting attempted at axiomatizing constructive geometry. Recently, von Plato used di4erent concepts to axiomatize the geometry: he used 14 axioms to describe the axiomatization for apartness geometry. Then he added axioms A1 and A2 to his apartness geometry to get his a8ne geometry, then he added axioms O1, O2, O3 and O4 to the a8ne geometry to get orthogonality. In total, this gi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the ACM
سال: 2005
ISSN: 0004-5411,1557-735X
DOI: 10.1145/1066100.1066102